Message-passing in stochastic processing networks
نویسنده
چکیده
Simple, distributed and iterative algorithms, popularly known as messagepassing, have become the architecture of choice for emerging infrastructure networks and the canonical behavioral model for natural networks. Therefore designing, as well as understanding, message-passing algorithms has become important. The purpose of this survey is to describe the state-of-art of message-passing algorithms in the context of dynamic resource allocation in the presence of uncertainty, a problem that is central to operations research (OR) and management science (MS). Various directions for future research are described in this context as well as connections beyond OR and MS are explained. Through this survey, we hope to convey the opportunity presented to the OR and MS community to benefit from and contribute to the growing inter-disciplinary area of message-passing algorithms.
منابع مشابه
Sparse Message Passing Algorithms for Weighted Maximum Satisfiability
Weighted maximum satisfiability is a wellstudied problem that has important applicability to artificial intelligence (for instance, MAP inference in Bayesian networks). General-purpose stochastic search algorithms have proven to be accurate and efficient for large problem instances; however, these algorithms largely ignore structural properties of the input. For example, many problems are highl...
متن کاملPreserving communication bandwidth with a gradient coding scheme
Large–scale machine learning involves the communicaiton of gradients, and large models often saturate the communication bandwidth to communicate gradients. I implement an existing scheme, quantized stochastic gradient descent (QSGD) to reduce the communication bandwidth. This requires a distributed architecture and we choose to implement a parameter server that uses the Message Passing Interfac...
متن کاملMessage Errors in Belief Propagation
Belief propagation (BP) is an increasingly popular method of performing approximate inference on arbitrary graphical models. At times, even further approximations are required, whether from quantization or other simplified message representations or from stochastic approximation methods. Introducing such errors into the BP message computations has the potential to adversely affect the solution ...
متن کاملA scalable community detection algorithm for large graphs using stochastic block models
Community detection in graphs is widely used in social and biological networks, and the stochastic block model is a powerful probabilistic tool for describing graphs with community structures. However, in the era of “big data,” traditional inference algorithms for such a model are increasingly limited due to their high time complexity and poor scalability. In this paper, we propose a multi-stag...
متن کاملInference in Deep Networks in High Dimensions
Deep generative networks provide a powerful tool for modeling complex data in a wide range of applications. In inverse problems that use these networks as generative priors on data, one must often perform inference of the inputs of the networks from the outputs. Inference is also required for sampling during stochastic training of these generative models. This paper considers inference in a dee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011